An Introduction to Hybrid Automata, Numerical Simulation and Reachability Analysis
نویسنده
چکیده
منابع مشابه
Numerical Simulation guided Lazy Abstraction Refinement for Nonlinear Hybrid Automata
This draft suggests a new counterexample guided abstraction refinement (CEGAR) framework that uses the combination of numerical simulation for nonlinear differential equations with linear programming for linear hybrid automata (LHA) to perform reachability analysis on nonlinear hybrid automata. A notion of ǫ− structural robustness is also introduced which allows the algorithm to validate counte...
متن کاملApproximated Reachability on Hybrid Automata: Falsification meets Certification
Undecidability of the reachability problem is ubiquitous in the context of hybrid automata. Being mostly based on either bounded reachability or on the notion of simulation preorder, current techniques for the approximated reachability analysis force to choose between underand over-approximations. In this paper, we introduce a novel method for the reachability analysis of hybrid automata featur...
متن کاملSReach: A Probabilistic Bounded δ-Reachability Analyzer for Stochastic Hybrid Systems
In this paper, we present a new tool SReach, which solves probabilistic bounded reachability problems for two classes of models of stochastic hybrid systems. The first one is (nonlinear) hybrid automata with parametric uncertainty. The second one is probabilistic hybrid automata with additional randomness for both transition probabilities and variable resets. Standard approaches to reachability...
متن کاملSReach: A Bounded Model Checker for Stochastic Hybrid Systems
In this paper we describe a new tool, SReach, which solves probabilistic bounded reachability problems for two classes of stochastic hybrid systems. The first one is (nonlinear) hybrid automata with parametric uncertainty. The second one is probabilistic hybrid automata with additional randomness for both transition probabilities and variable resets. Standard approaches to reachability problems...
متن کاملProperty Driven Three-Valued Model Checking on Hybrid Automata
In this paper, we present a three-valued property driven model checking algorithm for the logic CTL on hybrid automata. The technique of multivalued model checking for hybrid automata aims at combining the advantages of classical methods based either on the preorder of simulation or on bounded reachability. However, as originally defined, it relies on the preliminary definition of special abstr...
متن کامل